Stochastic Machine Scheduling with Precedence Constraints
نویسندگان
چکیده
منابع مشابه
Stochastic Machine Scheduling with Precedence Constraints
We consider parallel, identical machine scheduling problems where the jobs are subject to precedence constraints, release dates, and the processing times of jobs are governed by independent probability distributions. The objective is to minimize the expected value of the total weighted completion time ∑w j C j , where w j 0. Building upon a linear programming relaxation by Möhring, Schulz, and ...
متن کاملSingle Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملApproximation Algorithms for Stochastic Machine Scheduling with Precedence Constraints
We consider parallel, identical machine scheduling problems where the jobs are subject to precedence constraints, release dates, and the processing times of jobs are governed by independent probability distributions. The objective is to minimize the expected value of the total weighted completion time ∑w j C j , where w j 0. Building upon a linear programming relaxation by Möhring, Schulz, and ...
متن کاملThree-machine Scheduling Problem with Precedence Constraints
This paper deals with a three-machine flow-shop problem in which some of the job sequences are infeasible. It is assumed that jobs are grouped into several disJoint subsets within which a job order is pre-determined. Once the first job in a group has started on a machine, then the entire group must be completed on the machine without starting a job which does not belong to the group. It is furt...
متن کاملSingle-Machine Scheduling with Precedence Constraints
We discuss the problem of sequencing precedence-constrained jobs on a single machine to minimize the average weighted completion time. This problem has attracted much attention in the mathematical programming community since Sidney’s pioneering work in 1975 (Sidney, J. B. 1975. Decomposition algorithms for single machine scheduling with precedence relations and deferral costs. Operations Resear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2005
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539702415007